Efficient Address Mapping of Shared Cache for On%2DChip Many%2DCore Architecture.

Thread Owned Block Cache Managing Latency in Many%2DCore Architecture.

Bernoulli Sampling Based %28element of

Incorporating Instruction%2DBased Sampling into AMD CodeAnalyst.

Discovering Phrase%2DLevel Lexicon for Image Annotation.

An indoor tracking algorithm with the virtual reference based positioning.

Margin Based Sample Weighting for Stable Feature Selection.

Robust beamforming methods for multipath signal reception.

SINR analysis of the subtraction%2Dbased SMI beamformer.

Gabor texture representation method for face recognition using the Gamma and generalized Gaussian models.

An ab initio potential energy surface and vibrational energy levels of ZnH2.

Robust adaptive neural tracking control for a class of switched affine nonlinear systems.

Multilayer neural networks%2Dbased direct adaptive control for switched nonlinear systems.

Kernel%2DBased Transductive Learning with Nearest Neighbors.
Abstract. In the k-nearest neighbor (KNN) classifier, nearest neighbors involve only labeled data. That makes it inappropriate for the data set that includes very few labeled data. In this paper, we aim to solve the classification problem by applying transduction to the KNN algorithm. We consider two groups of nearest neighbors for each data point — one from labeled data, and the other from unlabeled data. A kernel function is used to assign weights to neighbors. We derive the recurrence relation of neighboring data points, and then present two solutions to the classification problem. One solution is to solve it by matrix computation for small or medium-size data sets. The other is an iterative algorithm for large data sets, and in the iterative process an energy function is minimized. Experiments show that our solutions achieve high performance and our iterative algorithm converges quickly. Key words: KNN, transductive learning, semi-supervised learning, kernel function
Algebraic observer for a class of switched systems with zeno phenomenon.

Algebraic observer for a class of switched systems with zeno phenomenon.

Design of New Hash Mapping Functions.

Stable and Accurate Feature Selection.

Grouping%2DBased Resilient Statistical En%2DRoute Filtering for Sensor Networks.

Consensus group stable feature selection.
Stability is an important yet under-addressed issue in feature selection from high-dimensional and small sample data. In this paper, we show that stability of feature selection has a strong dependency on sample size. We propose a novel framework for stable feature selection which first identifies consensus feature groups from subsampling of training samples, and then performs feature selection by treating each consensus feature group as a single entity. Experiments on both synthetic and real-world data sets show that an algorithm developed under this framework is effective at alleviating the problem of small sample size and leads to more stable feature selection results and comparable or better generalization performance than state-of-the-art feature selection algorithms. Synthetic data sets and algorithm source code are available at
Study on Fine%2DGrained Synchronization in Many%2DCore Architecture.

Service scheduling and rescheduling in an applications integration framework.

Effects of ignoring baseline on modeling transitions from intact cognition to dementia.

Feature cluster selection for high%2Dthroughput data analysis.

Multilevel Thresholding Method Based on Normalized Cut.

Godson%2DT An Efficient Many%2DCore Architecture for Parallel Program Executions.

A Novel Evaluating Model of CPV Vocational Ability Based on SVM Multilayer Classifier.

The Evaluation and Optimization of Enterprises%27 Production%2DRun Efficacy based on Factor Analysis and Fuzzy Association Rule Mining.

Using Visual Features for Fine%2DGrained Genre Classification of Web Pages.
The field of automatic genre classification has primarily focused on extracting textual features from documents. The goal of this research is to investigate whether visual features of HTML web pages can improve the classification of fine-grained genres. Intuitively it seems that this should be helpful and the challenge is to extract those visual features that capture the layout characteristics of the genres. A corpus of Web pages from different e-commerce sites was generated and manually classified into several genres. Three different sets of features were compared- one with just textual features, one with HTML level features added, and a third with visual features added. Our experiments confirm that using HTML features and particularly URL address features can improve classification beyond using textual features alone. We also show that adding visual features can be useful for further improving fine-grained genre classification.
Data Compression for Emitter Location Finding in Sensor Networks.

Stable feature selection via dense feature groups.
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selection for knowledge discovery from high-dimensional data, and identify two causes of instability of feature selection algorithms: selection of a minimum subset without redundant features and small sample size. We propose a general framework for stable feature selection which emphasizes both good generalization and stability of feature selection results. The framework identifies dense feature groups based on kernel density estimation and treats features in each dense group as a coherent entity for feature selection. An efficient algorithm DRAGS (Dense Relevant Attribute Group Selector) is developed under this framework. We also introduce a general measure for assessing the stability of feature selection algorithms. Our empirical study based on microarray data verifies that dense feature groups remain stable under random sample hold out, and the DRAGS algorithm is effective in identifying a set of feature groups which exhibit both high classification accuracy and stability.
A Trust Model Based on Subjective Logic for Multi%2DDomains in Grids.

Towards Answering How do I Questions Using Classification.

Feature Cluster Selection for High%2DThroughput Data Analysis.

CRM Method for Power Supply Enterprises Based on Analysis of Utility and Customers%5F Credit and Multistage Fuzzy Evaluation.



Visual features in genre classification of html.

Toward optimal selection of feature clusters.

Automatic Text Summarization Based on Lexical Chains and Structural Features.

Evolving Feature Selection.
We describe an evolutionary approach to active vision systems for dynamic feature selection. After summarizing recent work on evolution of a simulated active retina for complex shape discrimination, we describe in detail experiments that extend this approach to an all-terrain mobile robot equipped with a mobile camera. We show that evolved robots are capable of selecting simple visual features and actively maintaining them on the same retinal position, which largely simplifies the “recognition ” task, in order to generate efficient navigation trajectories with an extremely simple neural control system. Analysis of evolved solutions indicates that robots develop a simple


Redundancy based feature selection for microarray data.
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseases or phenotypes. The problem becomes particularly challenging due to the large number of features (genes) and small sample size. Traditional gene selection methods often select the top-ranked genes according to their individual discriminative power without handling the high degree of redundancy among the genes. Latest research shows that removing redundant genes among selected ones can achieve a better representation of the characteristics of the targeted phenotypes and lead to improved classification accuracy. Hence, we study in this paper the relationship between feature relevance and redundancy and propose an efficient method that can effectively remove redundant genes. The efficiency and effectiveness of our method in comparison with representative methods has been demonstrated through an empirical study using public microarray data sets.
A selective sampling approach to active feature selection.
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and improving result comprehensibility. Traditional feature selection methods resort to random sampling in dealing with data sets with a huge number of instances. In this paper, we introduce the concept of active feature selection, and investigate a selective sampling approach to active feature selection in a filter model setting. We present a formalism of selective sampling based on data variance, and apply it to a widely used feature selection algorithm Relief. Further, we show how it realizes active feature selection and reduces the required number of training instances to achieve time savings without performance deterioration. We design objective evaluation measures of performance, conduct extensive experiments using both synthetic and benchmark data sets, and observe consistent and significant improvement. We suggest some further work based on our study and experiments.
Efficient Feature Selection via Analysis of Relevance and Redundancy.
Feature selection is applied to reduce the number of features in many applications where data has hundreds or thousands of features. Existing feature selection methods mainly focus on finding relevant features. In this paper, we show that feature relevance alone is insufficient for efficient feature selection of high-dimensional data. We define feature redundancy and propose to perform explicit redundancy analysis in feature selection. A new framework is introduced that decouples relevance analysis and redundancy analysis. We develop a correlation-based method for relevance and redundancy analysis, and conduct an empirical study of its efficiency and effectiveness comparing with representative methods.
Feature Selection for High%2DDimensional Data A Fast Correlation%2DBased Filter Solution.
Feature selection, as a preprocessing step to machine learning, is effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and improving result comprehensibility. However, the recent increase of dimensionality of data poses a severe challenge to many existing feature selection methods with respect to efficiency and effectiveness. In this work, we introduce a novel concept, predominant correlation, and propose a fast filter method which can identify relevant features as well as redundancy among relevant features without pairwise correlation analysis. The efficiency and effectiveness of our method is demonstrated through extensive comparisons with other methods using real-world data of high dimensionality. 1.
Efficiently handling feature redundancy in high%2Ddimensional data.
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining. Traditionally, feature selection is focused on removing irrelevant features. However, for high-dimensional data, removing redundant features is equally critical. In this paper, we provide a study of feature redundancy in high-dimensional data and propose a novel correlation-based approach to feature selection within the filter model. The extensive empirical study using real-world data shows that the proposed approach is efficient and effective in removing redundant and irrelevant features.
Active Sampling An Effective Approach to Feature Selection.
Feature selection is frequently used in data preprocessing for data mining. It decreases number of features, removes irrelevant or noisy data, and increases mining performance such as predictive accuracy and comprehensibility. This work investigates active sampling in feature selection in a  lter model setting. Three versions of active sampling are proposed and empirically evaluated: two employ class information and the other utilizes feature variance. They are applied to a widely used, ecient feature selection algorithm Relief. In comparison with random sampling, we conduct extensive experiments with benchmark data sets.
Active Feature Selection Using Classes.
Abstract. Feature selection is frequently used in data pre-processing for data mining. When the training data set is too large, sampling is commonly used to overcome the difficulty. This work investigates the applicability of active sampling in feature selection in a filter model setting. Our objective is to partition data by taking advantage of class information so as to achieve the same or better performance for feature selection with fewer but more relevant instances than random sampling. Two versions of active feature selection that employ class information are proposed and empirically evaluated. In comparison with random sampling, we conduct extensive experiments with benchmark data sets, and analyze reasons why class-based active feature selection works in the way it does. The results will help us deal with large data sets and provide ideas to scale up other feature selection algorithms. 1
Active Sampling An Effective Approach to Feature Selection.
Feature selection is frequently used in data preprocessing for data mining. It decreases number of features, removes irrelevant or noisy data, and increases mining performance such as predictive accuracy and comprehensibility. This work investigates active sampling in feature selection in a  lter model setting. Three versions of active sampling are proposed and empirically evaluated: two employ class information and the other utilizes feature variance. They are applied to a widely used, ecient feature selection algorithm Relief. In comparison with random sampling, we conduct extensive experiments with benchmark data sets.


Consistency Control in Synchronous Cooperative Work.

Supporting Distributed Corporate Planning through New Coordination Technologies.

